Route optimization

ABSTRACT

In general, the present invention relates to route optimization/prediction. In one embodiment, the present invention provides visibility to future predicted traffic situations, based on all reserved routes in a system at a given point in time. This allows city planners, for example, to know where traffic will be to adjust traffic flow accordingly. Additional value comes into play by being able to calculate and publish aggregated savings from using this system, such as driver time, mileage, and gas. This information may be added to a database and made available to individuals via their GPS. In a typical implementation, a request for a route is received from a requester. Based on the request, an optimized route and a potential position of the requester within the optimized route are determined and then proposed to the requester. The requester can then select an option from the proposal.

TECHNICAL FIELD

The present invention generally relates to route optimization. In oneembodiment, the present invention relates to traffic route optimization.

BACKGROUND

The use of GPS navigation systems in automobiles is becomingcommonplace. Users are increasingly dependent on GPS devices to plan anddirect their routes, real-time. Currently, traffic is stochastic, aspeople drive to and from locations in a completely unpredictable manner.

Currently, when a large number of drivers are traveling to the samedestination, or in the same area, traffic jams occur with littlecoordinated planning to prevent them. Also, given the chaotic andcurrently unpredictable nature of society and driving, the quantity ofcars driving from random destinations, taking random routes, andarriving at random locations makes optimizing the system very difficult.For example, when a popular event is planned (e.g., sporting event orconcert), local authorities may dispatch officers to help directtraffic, or they may post signs warning of the traffic congestion. Whilethese responses are proactive in nature, they often do not have asignificant impact on traffic congestion, nor do they enable incentivesfor improved driving.

SUMMARY

In general, the present invention relates to routeoptimization/prediction. In one embodiment, the present inventionprovides visibility to future predicted traffic situations, based on allreserved routes in a system at a given point in time. This allows cityplanners, for example, to know where traffic will be to adjust trafficflow accordingly. Additional value comes into play by being able tocalculate and publish aggregated savings from using this system, such asdriver time, mileage, and gas. This information may be added to adatabase and made available to individuals via their GPS. In a typicalimplementation, a request for a route is received from a requester.Based on the request, an optimized route and a potential position of therequester within the optimized route are determined and then proposed tothe requester. The requester can then select an option from theproposal.

A first aspect of the present invention provides a method for optimizingroutes, comprising: receiving a request for a route from a requester;determining an optimized route and a potential position of the requesterwithin the optimized route based on the request; providing a proposal inresponse to the request, the proposal comprising the optimized route andthe potential position; and receiving a response to the proposal.

A second aspect of the present invention provides a system foroptimizing traffic routes, comprising: a memory medium comprisinginstructions; a bus coupled to the memory medium; and a processorcoupled to the bus that when executing the instructions causes thesystem to: receive a request for a traffic route from a requester;determine an optimized traffic route and a potential position of therequester within the optimized traffic route based on the request;provide a proposal in response to the request, the proposal comprisingthe optimized traffic route and the potential position; and receive aresponse to the proposal.

A third aspect of the present invention provides a computer readablestorage medium containing a program product for optimizing trafficroutes, the computer readable storage medium comprising program code forcausing a computer to: receive a request for a traffic route from arequester; determine an optimized traffic route and a potential positionof the requester within the optimized traffic route based on therequest; provide a proposal in response to the request, the proposalcomprising the optimized traffic route and the potential position; andreceive a response to the proposal.

A fourth aspect of the present invention provides a method for deployinga system for optimizing traffic routes, comprising: providing a computerinfrastructure being operable to: receive a request for a traffic routefrom a requester; determine an optimized traffic route and a potentialposition of the requester within the optimized traffic route based onthe request; provide a proposal in response to the request, the proposalcomprising the optimized traffic route and the potential position; andreceive a response to the proposal.

BRIEF DESCRIPTION OF THE DRAWINGS

These and other features of this invention will be more readilyunderstood from the following detailed description of the variousaspects of the invention taken in conjunction with the accompanyingdrawings in which:

FIG. 1 shows a first method flow diagram according to an embodiment ofthe present invention.

FIG. 2 shows a second method flow diagram according to an embodiment ofthe present invention.

FIG. 3 shows a third method flow diagram according to an embodiment ofthe present invention.

FIG. 4 shows a more specific computerized implementation according to anembodiment of the present invention.

FIG. 5 shows a method flow diagram according to an embodiment of thepresent invention.

The drawings are not necessarily to scale. The drawings are merelyschematic representations, not intended to portray specific parametersof the invention. The drawings are intended to depict only typicalembodiments of the invention, and therefore should not be considered aslimiting the scope of the invention. In the drawings, like numberingrepresents like elements.

DETAILED DESCRIPTION

For convenience, the Detailed Description of the Invention has thefollowing sections:

I. General Description

II. Computerized Implementation

I. General Description

As indicated above, the present invention relates to routeoptimization/prediction. In one embodiment, the present inventionprovides visibility to future predicted traffic situations, based on allreserved routes in a system at a given point in time. This allows cityplanners, for example, to know where traffic will be to adjust trafficflow accordingly. Additional value comes into play by being able tocalculate and publish aggregated savings from using this system, such asdriver time, mileage, and gas. This information may be added to adatabase and made available to individuals via their GPS. In a typicalimplementation, a request for a route is received from a requester.Based on the request, an optimized route and a potential position of therequester within the optimized route are determined and then proposed tothe requester. The requester can then select an option from theproposal.

One added and useful benefit that this system provides is visibility tofuture predicted traffic situations, based on all reserved routes in thesystem at a given point in time. This allows city planners, for example,to know where traffic will be and adjust traffic flow accordingly.Additional value comes into play by being able to calculate and publishaggregated savings from using this system, such as driver time, mileage,and gas. This information may be added to a database and made availableto individuals via their GPS.

In a typical embodiment, this invention allows drivers to designatetheir intended driving route to/from an event or location in advance,and “reserve” a driving route. By doing this, GPS or other navigationalsystems can then be used to calculate user travel routes in ways thatwill:

-   -   1. improve traffic congestion;    -   2. enable drivers to select routes that coincide with latest        designated “preferred” routes to/from a given event or location;    -   3. enable event coordinators, sellers or local public works        departments to reward achieving of desired traffic patterns; and    -   4. create markets for trading assigned traffic routings.        It is assumed that a finite number of reservations are available        at any given time for a specific route due to size of roads,        road conditions, traffic expectations etc., making the route        reservation a desirable asset.

A summary of the steps for this system are as follows:

1. Request Route.

2. Optimize Route.

3. Reserve Route.

4. Queue Route.

5. Deliver Route and Offers.

6. Trade Route (optionally).

7. Collect feedback & learn for future routing.

This invention provides a benefit for the society as a whole byoptimizing the overall patterns of traffic to minimize congestion.Although each participant may not get the most direct route forhis/herself, traffic jams will be avoided and the greater good will beserved. The currently random system of traffic is optimized.

Referring now to FIG. 1, a first process flow diagram according to anembodiment of the present invention is shown. As depicted, drivers 1-3can request routes (e.g., automated) using various techniques such anevent attraction/incentive system 10A, a GPS/navigation system 10Band/or a local alert system 10C (e.g., safety, weather, etc.). With thisinvention, if a driver requests and registers his/her route early, (s)heis more likely to be given his preferred path than someone that requeststhe route last-minute. Users are incented to participate since thishelps in planning for high volume traffic, especially in situations thatdo not follow predictable patterns. Cities may then change the timing oflights, etc. to accommodate this predicted traffic.

The requests can be routed via request databases 12A-C to routeregistration engine 14, which manages all routes between variousregistrations. Based on the request, the route registration engine willdetermine a set (at least one) of optimized routes for each driver 1-3,and route queue engine 16 will determine a potential position of eachdriver within each corresponding route. For example, assume that twooptimized routes (e.g., A and B) have been determined for driver 1. Itcould be the case that driver 1 would be assigned a potential positionof 20^(th) within route A, and position of 15^(th) within route B. In atypical embodiment, optimal routings for each driver can be determinedbased upon the following inputs:

-   -   Driver route requests and preferences. For example: allow me to        leave at the last possible minute or ensure I am not late, etc.    -   Automated route requests.    -   Promotions (e.g., free parking to first 100 registrants;        t-shirt; ticket discounts; toll reductions). Market incentives        are introduced to allow the consumers to opt in. Network        externality (i.e., network effect) applies to this invention        because the more people that participate, the better it works        for all.    -   Public works data (e.g., water main break on Main Street, or bad        weather slowdowns).

Routing optimization may be based on, but not limited to:

-   -   The number of days in advance that a request is made;    -   Type of car being driven (e.g., reward fuel efficient models);    -   Designated “preferred paths” (e.g., avoiding school zones during        certain hours, HOV lanes, or partial/full routes reserved only        for participants)

A route may be dynamically changed based on the real-time situation.

For example:

-   -   “Route correction” requests can be automatically generated in        the event you are running late for your assigned route. The GPS        system knows what time you start your car and the assigned start        time of your reserved route. If these are different, a new route        may be automatically generated & reserved.    -   The original route you registered for weeks ago has been        “upgraded” based on new real-time factors (e.g., cancellations        which bump you up in the queue). In the case of upgrades,        incentives may also accompany the new upgraded route.

Business intelligence (BI) & analytics:

-   -   Use of BI and known analytical tools to determine what routes        are working and which are not, and provide feedback to the        system to enable future updates of routing algorithms. This        feedback may be based on an individual's route success ratios        (e.g., number of routes completed within specified window of        assigned timings for the route vs. the number of times the exact        route was used), OR on the user population as a whole (i.e.,        analyze ALL of the success ratios of a given pool of route        reserving users).    -   Identification of instances where drivers (e.g., a pool of        drivers) take more or less time to traverse a piece of road than        is predicted based upon known variables. These instances are        noted and the system automatically accounts for different        timings in the future. This takes into account factors which may        not be known to the GPS or computer system, such as severe pot        holes, dirt road washouts etc.    -   The system logs and recognizes instances where you leave later        than assigned but arrive earlier than expected at your        destination and adjusts future routes accordingly (e.g., for        forecasting purposes).

In addition, the position of a driver within a route represents thedriver's order in the broader routing plan. Along these lines, thefollowing features are provided under the invention:

-   -   If a driver cancels or does not take the preregistered route,        the queue can be dynamically updated to offer new routes to        those next in line.    -   The route queue engine 16 has the ability to compare exact        locations vs. preregistered routes to check for compliance. This        may be accomplished by applying customizable rules to define        local compliance guidelines (e.g., rewarding frequent driver        points under certain conditions).

Regardless, referring to FIG. 2, once optimized routes and potentialpositions are determined, they will be sent back to the correspondingdrivers 1-3 as proposals via route queue engine 16. Each driver 1-3 canthen make a determination as to which route to select. If none aredesirable, the process will repeat and a new proposal will be determined(if possible). If a selection of a particular route/position is made,that route and position will be reserved (e.g., by route queue engine16).

In delivering the routes and offers/proposals, the following functionsare provided hereunder:

-   -   The requesters' optimized route is sent back to the requester,        along with any applicable offers/promotions.    -   The requester may accept or reject the assigned route. If        rejected, the requester may place a new route request.    -   The requester may also cancel a previously registered route.    -   For requesters that do NOT take their assigned routes,        offers/incentives may be revoked or diminished.    -   Likewise, rewards and/or incentives may be adjusted dynamically        based on real-time changes to the routes.

An additional feature of the invention is the ability of drivers totrade routes and/or positions. For example, referring to FIG. 3, routetrade engine 18 can coordinate the offering, accepting, and reassignmentof routes and/or positions within routes between drivers. Assume thatdriver 1 has been assigned route A and position X. Further assume thatdriver 2 has been assigned route B and position Y. The two have thecapability to trade either routes or positions. This tracking andmanagement of this exchange is coordinated by the route trading engine.It should be understood that the trades can be conducted in accordancewith any trading approach now known or later developed. For example,routes/positions could be traded in an auction format, they could beexchanged concurrently for another route/position or some othercompensation (e.g., financial), or they could be traded for acompensation to be determined later.

Example Scenario

-   -   1. High traffic-volume event is planned for a location (e.g.,        important sporting event or concert).    -   2. When a user purchases a ticket to the event, it is        automatically registered to the routing system.    -   3. His home address is used as a default starting point or if he        requests anonymity, his general neighborhood is given as a        starting point.    -   4. User's route is recorded, including expected time of        departure, rate of travel over route, and expected time of        arrival.    -   5. Routing system may predict how many people will be on the        road at that time and what routes they will take, so it can        preemptively reroute certain people to prevent a traffic jam.    -   6. People who purchased their ticket early and had their route        registered early are assigned the most direct route. They are        incented for their participation in helping with traffic        management for all.    -   7. Others who purchased their tickets late are assigned a        slightly longer route, but one that will prevent jams for all.        They are incented for following their prescribed route.        II. Computerized Implementation

Referring now to FIG. 4, a computerized implementation 100 of thepresent invention is shown. As depicted, implementation 100 includes acomputer system 104 deployed within a computer infrastructure 102. Thisis intended to demonstrate, among other things, that the presentinvention could be implemented within a network environment (e.g., theInternet, a wide area network (WAN), a local area network (LAN), avirtual private network (VPN), etc.), or on a stand-alone computersystem. In the case of the former, communication throughout the networkcan occur via any combination of various types of communication links.For example, the communication links can comprise addressableconnections that may utilize any combination of wired and/or wirelesstransmission methods. Where communications occur via the Internet,connectivity could be provided by conventional TCP/IP sockets-basedprotocol, and an Internet service provider could be used to establishconnectivity to the Internet. Still yet, computer infrastructure 102 isintended to demonstrate that some or all of the components ofimplementation 100 could be deployed, managed, serviced, etc., by aservice provider who offers to implement, deploy, and/or perform thefunctions of the present invention for others.

As shown, computer system 104 includes a processing unit 106, a memory108, a bus 110, and a device interfaces 112. Further, computer system104 is shown having external devices 114 and storage system 116 thatcommunicate with bus 110 via device interfaces 112. In general,processing unit 106 executes computer program code, such as routeoptimization software/program 118, which is stored in memory 108 and/orstorage system 116. While executing computer program code, processingunit 106 can read and/or write data to/from memory 108, storage system116, and/or device interfaces 112. Bus 110 provides a communication linkbetween each of the components in computer system 104. Although notshown, computer system 104 could also include I/O interfaces thatcommunicate with: one or more external devices such as a keyboard, apointing device, a display, etc.; one or more devices that enable a userto interact with computer system 104; and/or any devices (e.g., networkcard, modem, etc.) that enable computer system 104 to communicate withone or more other computing devices.

Computer infrastructure 102 is only illustrative of various types ofcomputer infrastructures for implementing the invention. For example, inone embodiment, computer infrastructure 102 comprises two or morecomputing devices (e.g., a server cluster) that communicate over anetwork to perform the various processes of the invention. Moreover,computer system 104 is only representative of various possible computersystems that can include numerous combinations of hardware. To thisextent, in other embodiments, computer system 104 can comprise anyspecific purpose-computing article of manufacture comprising hardwareand/or computer program code for performing specific functions, anycomputing article of manufacture that comprises a combination ofspecific purpose and general purpose hardware/software, or the like. Ineach case, the program code and hardware can be created using standardprogramming and engineering techniques, respectively. Moreover,processing unit 106 may comprise a single processing unit, or bedistributed across one or more processing units in one or more locations(e.g., on a client and server). Similarly, memory 108 and/or storagesystem 116 can comprise any combination of various types of data storageand/or transmission media that reside at one or more physical locations.Further, device interfaces 112 can comprise any module for exchanginginformation with one or more external devices. Still further, it isunderstood that one or more additional components (e.g., systemsoftware, math co-processing unit, etc.) not shown in FIG. 4 can beincluded in computer system 104.

Storage system 116 can be any type of system capable of providingstorage for information under the present invention such as itemappearances. To this extent, storage system 116 could include one ormore storage devices, such as a magnetic disk drive or an optical diskdrive. In another embodiment, storage system 116 includes datadistributed across, for example, a local area network (LAN), wide areanetwork (WAN) or a storage area network (SAN) (not shown). In addition,although not shown, additional components, such as cache memory,communication systems, system software, etc., may be incorporated intocomputer system 104.

Shown in memory 108 of computer system 104 is route optimization program118, with a set of modules 120. The modules 120 generally provide thefunctions of the present invention as described herein. Specifically(among other things), set of modules 120 is configured to (as shown inconjunction with the method flow diagram of FIG. 5: receive a requestfor a route from a requester in step S1; determine an optimized routeand a potential position of the requester within the optimized routebased on the request in step S2; provide a proposal in response to therequest, the proposal comprising the optimized route and the potentialposition in step S3; receive a response to the proposal S4; and reservethe optimized route pending the response in step S5.

While shown and described herein as a route optimization solution, it isunderstood that the invention further provides various alternativeembodiments. For example, in one embodiment, the invention provides acomputer-readable/useable storage medium that includes computer programcode to enable a computer infrastructure to provide a route optimizationsolution. To this extent, the computer-readable/useable storage mediumincludes program code that implements each of the various process of theinvention. It is understood that the terms computer-readable storagemedium or computer useable storage medium comprise one or more of anytype of physical embodiment of the program code. In particular, thecomputer-readable/useable storage medium can comprise program codeembodied on one or more portable storage articles of manufacture (e.g.,a compact disc, a magnetic disk, a tape, etc.), on one or more datastorage portions of a computing device, such as memory 108 (FIG. 4)and/or storage system 116 (FIG. 4) (e.g., a fixed disk, a read-onlymemory, a random access memory, a cache memory, etc.).

In another embodiment, the invention provides a method that performs theprocess of the invention on a subscription, advertising, and/or feebasis. That is, a service provider, such as a Solution Integrator, couldoffer to provide a route optimization solution. In this case, theservice provider can create, maintain, support, etc., a computerinfrastructure, such as computer infrastructure 102 (FIG. 4) thatperforms the process of the invention for one or more customers. Inreturn, the service provider can receive payment from the customer(s)under a subscription and/or fee agreement and/or the service providercan receive payment from the sale of advertising cont6

In still another embodiment, the invention provides acomputer-implemented method for route optimization. In this case, acomputer infrastructure, such as computer infrastructure 102 (FIG. 4),can be provided and one or more systems for performing the process ofthe invention can be obtained (e.g., created, purchased, used, modified,etc.) and deployed to the computer infrastructure. To this extent, thedeployment of a system can comprise one or more of: installing programcode on a computing device, such as computer system 104 (FIG. 4), from acomputer-readable medium; adding one or more computing devices to thecomputer infrastructure; and incorporating and/or modifying one or moreexisting systems of the computer infrastructure to enable the computerinfrastructure to perform the process of the invention.

As used herein, it is understood that the terms “program code” and“computer program code” are synonymous and mean any expression, in anylanguage, code, or notation, of a set of instructions intended to causea computing device having an information processing capability toperform a particular function either directly or after either or both ofthe following: (a) conversion to another language, code, or notation;and/or (b) reproduction in a different material form. To this extent,program code can be embodied as one or more of: an application/softwareprogram, component software/a library of functions, an operating system,a basic device system/driver for a particular computing and/or device,and the like.

A data processing system suitable for storing and/or executing programcode can be provided hereunder and can include at least one processorcommunicatively coupled, directly or indirectly, to memory elementthrough a system bus. The memory elements can include, but are notlimited to, local memory employed during actual execution of the programcode, bulk storage, and cache memories that provide temporary storage ofat least some program code in order to reduce the number of times codemust be retrieved from bulk storage during execution. Input/output orother external devices (including, but not limited to, keyboards,displays, pointing devices, etc.) can be coupled to the system eitherdirectly or through intervening device controllers.

Network adapters also may be coupled to the system to enable the dataprocessing system to become coupled to other data processing systems,remote printers, storage devices, and/or the like, through anycombination of intervening private or public networks. Illustrativenetwork adapters include, but are not limited to, modems, cable modems,and Ethernet cards.

The foregoing description of various aspects of the invention has beenpresented for purposes of illustration and description. It is notintended to be exhaustive or to limit the invention to the precise formdisclosed, and obviously, many modifications and variations arepossible. Such modifications and variations that may be apparent to aperson skilled in the art are intended to be included within the scopeof the invention as defined by the accompanying claims.

What is claimed is:
 1. A method for optimizing routes, comprising:receiving, using at least one computing device, a request for a routefrom a requester, the requester having a vehicle associated therewith;determining, using the at least one computing device, an optimized routeand a potential position of the requester within the optimized routebased on the request; providing, using the at least one computingdevice, a proposal in response to the request, the proposal comprisingthe optimized route and the potential position; receiving, using the atleast one computing device, a response to the proposal; assigning, usingthe at least one computing device, the requester to the optimized route,the potential position, and a start time when the response comprises anacceptance of the proposal; providing, using the at least one computingdevice, an incentive to the requester based on an advance time of atleast one of the request for the route and a reservation of the route;dynamically adjusting, using the at least one computing device, theincentive based on real-time changes to the route; and automaticallygenerating, using the at least one computing device, an alternate routein response to a detection, via Global Positioning Satellite technology,that the requester started the vehicle at a different time from theassigned start time, the alternate route accounting for the differenttime.
 2. The method of claim 1, further comprising reserving, using theat least one computing device, the optimized route pending the response.3. The method of claim 1, the proposal further comprising a set ofalternative optimized routes and corresponding potential positions. 4.The method of claim 1, further comprising trading, using the at leastone computing device, the optimized route and the potential position ofthe requester with another optimized route and another potentialposition of another requester.
 5. The method of claim 1, furthercomprising collecting feedback based on an execution of the proposal. 6.The method of claim 1, the route being a traffic route, and thedetermining being based on Global Positioning Satellite (GPS)technology.
 7. A system for optimizing traffic routes, comprising: amemory medium comprising instructions; a bus coupled to the memorymedium; and a processor coupled to the bus that when executing theinstructions causes the system to: receive a request for a traffic routefrom a requester, the requester having a vehicle associated therewith;determine an optimized traffic route and a potential position of therequester within the optimized traffic route based on the request;provide a proposal in response to the request, the proposal comprisingthe optimized traffic route and the potential position; receive aresponse to the proposal; assign the requester to the optimized route,the potential position, and a start time when the response comprises anacceptance of the proposal; provide an incentive to the requester basedon an advance time of at least one of the request for the route and areservation of the route; dynamically adjust the incentive based onreal-time changes to the route; and automatically generate an alternateroute in response to a detection, via Global Positioning Satellitetechnology, that the requester started the vehicle at a time differentfrom the assigned start time, the alternate route accounting for thedifferent time.
 8. The system of claim 7, the system further beingcaused to reserve the optimized traffic route pending the response. 9.The system of claim 7, the proposal further comprising a set ofalternative optimized traffic routes and corresponding potentialpositions.
 10. The system of claim 7, the system further being caused totrade the optimized traffic route and the potential position of therequester with another optimized traffic route and another potentialposition of another requester.
 11. The system of claim 7, the systemfurther being caused to collect feedback based on an execution of theproposal.
 12. The system of claim 7, the optimized traffic route beingdetermined based on Global Positioning Satellite (GPS) technology.
 13. Anon-transitory computer readable storage medium containing a programproduct for optimizing traffic routes, the computer readable storagemedium comprising program code for causing a computer to: receive arequest for a traffic route from a requester, the requester having avehicle associated therewith; determine an optimized traffic route and apotential position of the requester within the optimized traffic routebased on the request; provide a proposal in response to the request, theproposal comprising the optimized traffic route and the potentialposition; receive a response to the proposal; assign the requester tothe optimized route, the potential position, and a start time when theresponse comprises an acceptance of the proposal; provide an incentiveto the requester based on an advance time of at least one of the requestfor the route and a reservation of the route; dynamically adjust theincentive based on real-time changes to the route; and automaticallygenerate an alternate route in response to a detection, via GlobalPositioning Satellite technology, that the requester started the vehicleat a different time from the assigned start time, the new routeaccounting for the different time.
 14. The computer readable storagemedium containing the program product of claim 13, the computer readablestorage medium further comprising program code for further causing thecomputer to reserve the optimized traffic route pending the response.15. The computer readable storage medium containing the program productof claim 13, the proposal further comprising a set of alternativeoptimized traffic routes and corresponding potential positions.
 16. Thecomputer readable storage medium containing the program product of claim13, the computer storage readable medium further comprising program codefor further causing the computer to trade the optimized traffic routeand the potential position of the requester with another optimizedtraffic route and another potential position of another requester. 17.The computer readable storage medium containing the program product ofclaim 13, the computer readable storage medium further comprisingprogram code for further causing the computer to collect feedback basedon an execution of the proposal.
 18. The computer readable storagemedium containing the program product of claim 13, the optimized trafficroute being determined based on Global Positioning Satellite (GPS)technology.
 19. A method for deploying a system for optimizing trafficroutes, comprising: providing a computer infrastructure being operableto: receive, via the computer infrastructure, a request for a trafficroute from a requester, the requester having a vehicle associatedtherewith; determine, via the computer infrastructure, an optimizedtraffic route and a potential position of the requester within theoptimized traffic route based on the request; provide, via the computerinfrastructure, a proposal in response to the request, the proposalcomprising the optimized traffic route and the potential position;receive, via the computer infrastructure, a response to the proposal;and assign, via the computer infrastructure, the requester to theoptimized route, the potential position, and a start time when theresponse comprises an acceptance of the proposal; provide, via thecomputer infrastructure, an incentive to the requester based on anadvance time of at least one of the request for the route and areservation of the route; dynamically adjust, via the computerinfrastructure, the incentive based on real-time changes to the route;and automatically generate, via the computer infrastructure, analternate route in response to a detection, via Global PositioningSatellite technology, that the requester started the vehicle at adifferent time from the assigned start time, the alternate routeaccounting for the different time.